Multipliers and general Lagrangians
نویسندگان
چکیده
We combine a Lagrangian approach inspired by convex and quasiconvex dualities with a penalization approach to mathematical programming. We use the ideas of abstract convexity. We focus our attention on the set of multipliers. We look for an interpretation of multipliers as elements of generalized subdifferentials of the performance function associated with a dualizing parameterization of the given problem.
منابع مشابه
Penalty/Barrier Multiplier Methods for Convex Programming Problems
We study a class of methods for solving convex programs, which are based on nonquadratic Augmented Lagrangians for which the penalty parameters are functions of the multipliers. This gives rise to lagrangians which are nonlinear in the multipliers. Each augmented lagrangian is speciied by a choice of a penalty function ' and a penalty-updating function. The requirements on ' are mild, and allow...
متن کاملNonlinear rescaling vs. smoothing technique in convex optimization
We introduce an alternative to the smoothing technique approach for constrained optimization. As it turns out for any given smoothing function there exists a modification with particular properties. We use the modification for Nonlinear Rescaling (NR) the constraints of a given constrained optimization problem into an equivalent set of constraints. The constraints transformation is scaled by a ...
متن کاملAugmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
The theory of the proximal point algorithm for maximal monotone operators is applied to three algorithms for solving convex programs, one of which has not previously been formulated. Rate-of-convergence results for the "method of multipliers," of the strong sort already known, are derived in a generalized form relevant also to problems beyond the compass of the standard second-order conditions ...
متن کاملGeneral conditions for the existence of non-standard Lagrangians for dissipative dynamical systems
Equations of motion describing dissipative dynamical systems with coefficients varying either in time or in space are considered. To identify the equations that admit a Lagrangian description, two classes of non-standard Lagrangians are introduced and general conditions required for the existence of these Lagrangians are determined. The conditions are used to obtain some non-standard Lagrangian...
متن کاملMultistage stochastic convex programs: Duality and its implications
In this paper, we study alternative primal and dual formulations of multistage stochastic convex programs (SP). The alternative dual problems which can be traced to the alternative primal representations, lead to stochastic analogs of standard deterministic constructs such as conjugate functions and Lagrangians. One of the by-products of this approach is that the development does not depend on ...
متن کامل